Biomolecular Sampling: Algorithms, Test Molecules, and Metrics
نویسندگان
چکیده
We compare the effectiveness of different simulation sampling techniques by illustrating their application to united atom butane, alanine dipeptide, and a small solvated protein, BPTI. We introduce an optimization of the Shadow Hybrid Monte Carlo (SHMC) algorithm, a rigorous method that removes the bias of molecular dynamics (MD). We also evaluate the ability of constant-temperature MD methods (based on Langevin and Nosé-Hoover dynamics) to achieve uniform thermal equilibrium. Our results show the the superiority of Langevin dynamics over Nosé-Hoover dynamics to achieve thermal equilibrium. They also illustrate the inherent limitation of sampling protocols that rely on sampling the microcanonical and canonical ensemble at only one temperature, and the importance of generalized ensemble approaches such as replica exchange that sample using different temperatures. Finally, we show how SHMC is able to remove bias and scale with timestep and system size. Presented, herein, are a set of sampling algorithms, test molecules, 2 and metrics. We make the sampling methods discussed available via the open source and freely distributed ProtoMol molecular simulation framework. For a system of N atoms, define configuration space as a dN dimensional vector of positions, where d is the number of degrees of freedom per atom. Similarly , phase space is defined by both configuration and momenta and is 2dN dimensional. The problem of sampling the configuration space of biomolecules such as proteins is an inherently difficult problem. The difficulties are due to the high dimensionality of phase space (6N), the ruggedness of the energy functions, the presence of multiple time scales, high energy barriers, and the introduction of systematic error (bias) by sampling methods.
منابع مشابه
Accounting for receptor flexibility and enhanced sampling methods in computer-aided drug design.
Protein flexibility plays a major role in biomolecular recognition. In many cases, it is not obvious how molecular structure will change upon association with other molecules. In proteins, these changes can be major, with large deviations in overall backbone structure, or they can be more subtle as in a side-chain rotation. Either way the algorithms that predict the favorability of biomolecular...
متن کاملKinetically-aware Conformational Distances in Molecular Dynamics
In this paper, we present a novel approach for discovering kinetically metastable states of biomolecular conformations. Several kinetically-aware metrics which encode both geometric and kinetic information about biomolecules are proposed. We embed the new metrics into k-center clustering and r-cover clustering algorithms to estimate the metastable states. Those clustering algorithms using kinet...
متن کاملComparing biomolecular contact structures: the algebraic way
Contact structures are simplified models of RNA molecules, proteins, and other biopolymer three-dimensional structures. In this paper we study several algebraic representations of biomolecular contact structures and some metrics on sets of contact structures of a given length derived from these representations. We take the opportunity to recall a few problems that remain open in this field of r...
متن کاملDetection of Ammonia and Phosphine Gas using Heterojunction Biomolecular Chain with Multilayer GaAs Nanopore Electrode
This paper presents Density Functional Theory and Non-Equilibrium Green’s Function based First Principles calculations to explore the sensing property of Adenine and Thymine based hetero-junction chins for Ammonia and Phosphine gas molecules. This modeling and simulation technique plays an important and crucial role in the fast growing semiconductor based nanotechnology field. The hetero-juncti...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کامل